Packet Reordering To Improve Data Center Network Using Near Optimal Traffic Engineering

Data Centers are large collection of computers owned and operated by single or group of organizations. It is necessary to handle huge amount of data, there by traffic is complicated. To reduce the traffic volume and to diverse traffic in an effective way, I would like to introduce PEFT (Penalizing Exponential Flow spliTing), which penalize the longer path and diverse traffic in unequal cost path to reach its destination with in short time. An end-to-end transport layer protocol called migratory Transmission Control Protocol, which aggregate the available bandwidth of those redundant paths in parallel and also become more robust under path failures. Whenever some path fails, migratory Transmission Control Protocol will send the packets on other living paths and within few seconds it will be recovered. A shared detection mechanism is integrated into this system which dynamically detects and suppress paths with shared congestion so as to avoid the aggressiveness problem. A new scheduling algorithm can be used here to reorder the packet in an effective ways, that scheduling algorithm is PET (Packet Pair based earliest Delivery Path First) which effectively utilize full bandwidth and minimize the reordering together with Buffer Management Policy. General Terms Design, Performance